Proof of the Authentication Property of Secure WLAN Authentication Scheme (SWAS) using Protocol Composition Logic (PCL)
نویسندگان
چکیده
Authentication is one of the essential tools available for security in WLANs. Access control authentication mechanisms provides entity authentication, access into the network and key evolving for data frames protection. Secure WLAN Authentication Scheme (SWAS) is one such access control authentication mechanism. It provides entity authentication along with per frame authentication. All the participating entities in the scheme i.e. STA, AP and AS authenticate each other. The scheme makes use of cryptographic measure like delegation, key management, encryption and MIC for securing the scheme. The security properties of the scheme need to be validated for effectiveness. In this paper, a formal tool i.e. Protocol Composition Logic (PCL) is used for proving the authentication property of the scheme. General Terms Networks, Security, WLAN
منابع مشابه
An efficient non-repudiation billing protocol in heterogeneous 3G-WLAN networks
The wireless communication with delivering variety of services to users is growing rapidly in recent years. The third generation of cellular networks (3G), and local wireless networks (WLAN) are the two widely used technologies in wireless networks. 3G networks have the capability of covering a vast area; while, WLAN networks provide higher transmission rates with less coverage. Since the two n...
متن کاملAn ECC-Based Mutual Authentication Scheme with One Time Signature (OTS) in Advanced Metering Infrastructure
Advanced metering infrastructure (AMI) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication. This study focuses on communication between a smart meter and a server on the utility side. Hence, a mutual authentication mechanism in AMI is presented based on the elliptic curve cryptography (ECC) and one time signature (OTS) consists o...
متن کاملFormal Analysis of Security Protocols: Protocol Composition Logic a Dissertation Submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
We develop Protocol Composition Logic (PCL) – a Floyd-Hoare style logic for axiomatic proofs of protocol properties that is sound with respect to the standard symbolic model of protocol execution and attack. PCL can express temporal ordering of actions and knowledge, naturally capturing security properties such as authentication and secrecy. The induction rule for proving invariants and the com...
متن کاملAutomated Proof of Authentication Protocols in a Logic of Events
Using the language of event orderings and event classes, and using a type of atoms to represent nonces, keys, signatures, and ciphertexts, we give an axiomatization of a theory in which authentication protocols can be formally defined and strong authentication properties proven. This theory is inspired by PCL, the protocol composition logic defined by Datta, Derek, Mitchell, and Roy. We develop...
متن کاملProtocol Composition Logic
Protocol Composition Logic (PCL) is a logic for proving authentication and secrecy properties of network protocols. This chapter presents the central concepts of PCL, including a protocol programming language, the semantics of protocol execution in the presence of a network attacker, the syntax and semantics of PCL assertions, and axioms and proof rules for proving authentication properties. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013